Development of Hybrid Algorithm for Integrated Aircraft Routing Problem and Crew Pairing Problem
نویسندگان
چکیده
منابع مشابه
Models and Algorithms for an Integrated Fleet-Assignment, Aircraft-Routing and Crew-Pairing Problem
We study an optimization problem of a regional airline company. The problem integrates three stages of the planning process that are typically solved in sequence: fleet assignment, aircraft routing and crew pairing. Aircraft maintenance is also taken into account. We present two mathematical formulations for the integrated problem. One formulation could be considered the natural model where bot...
متن کاملA hybrid metaheuristic algorithm for the robust pollution-routing problem
Emissions resulted from transportation activities may lead to dangerous effects on the whole environment and human health. According to sustainability principles, in recent years researchers attempt to consider the environmental burden of logistics activities in traditional logistics problems such as vehicle routing problems (VRPs). The pollution-routing problem (PRP) is an extension of the VRP...
متن کاملA HYBRID ALGORITHM FOR THE OPEN VEHICLE ROUTING PROBLEM
The open vehicle routing problem (OVRP) is a variance of the vehicle routing problem (VRP) that has a unique character which is its open path form. This means that the vehicles are not required to return to the depot after completing service. Because this problem belongs to the NP-hard problems, many metaheuristic approaches like the ant colony optimization (ACO) have been used to solve OVRP in...
متن کاملA computational study of Benders decomposition for the integrated aircraft routing and crew scheduling problem
The integrated aircraft routing and crew scheduling problem consists in determining a minimum-cost set of aircraft routes and crew pairings such that each 1ight leg is covered by one aircraft and one crew, and side constraints are satis2ed. While some side constraints involve only crews or aircraft, linking constraints impose minimum connection times for crews that depend on aircraft connection...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Indian Journal of Science and Technology
سال: 2017
ISSN: 0974-5645,0974-6846
DOI: 10.17485/ijst/2016/v9i48/108696